New lattice construction for partial key exposure attack for RSA
نویسنده
چکیده
In this paper we present a new lattice construction for a lattice based partial key exposureattack for the RSA cryptography. We consider the situation that the RSA secret key d is smalland a sufficient amount of the LSBs (least significant bits) of d are known by the attacker. Weshow that our lattice construction is theoretically more efficient than known attacks proposedin [1, 6].
منابع مشابه
A New Lattice Construction for Partial Key Exposure Attack for RSA
In this paper we present a new lattice construction for a lattice based partial key exposure attack for the RSA cryptography. We consider the situation that the RSA secret key d is small and a sufficient amount of the LSBs (least significant bits) of d are known by the attacker. We show that our lattice construction is theoretically more efficient than known attacks proposed in [2, 7].
متن کامل1342 - 2812 A new lattice construction for partial key exposure attack for RSA ( revised ) Yoshinori Aono
In this paper we present a new lattice construction for a lattice based partial key exposure attack for the RSA cryptography. We consider the situation that the RSA secret key d is small and a sufficient amount of the LSBs (least significant bits) of d are known by the attacker. We show that our lattice construction is theoretically more efficient than known attacks proposed in [2, 7]. This is ...
متن کاملPartial Key Exposure Attacks on Rsa and Its Variant by Guessing a Few Bits of One of the Prime Factors
Consider RSA with N = pq, q < p < 2q, public encryption exponent e and private decryption exponent d. We first study cryptanalysis of RSA when certain amount of the Most Significant Bits (MSBs) or Least Significant Bits (LSBs) of d is known. The basic lattice based technique is similar to that of Ernst et al. in Eurocrypt 2005. However, our idea of guessing a few MSBs of the secret prime p subs...
متن کاملNew Partial Key Exposure Attacks on RSA Revisited
At CRYPTO 2003, Blömer and May presented new partial key exposure attacks against RSA. These were the first known polynomial-time partial key exposure attacks against RSA with public exponent e > N . Attacks for known most significant bits and known least significant bits were presented. In this work, we extend their attacks to multi-prime RSA. For r-prime RSA, these result in the first known p...
متن کاملPartial Key Exposure Attack on RSA - Improvements for Limited Lattice Dimensions
Consider the RSA public key cryptosystem with the parameters N = pq, q < p < 2q, public encryption exponent e and private decryption exponent d. In this paper, cryptanalysis of RSA is studied given that some amount of the Most Significant Bits (MSBs) of d is exposed. In Eurocrypt 2005, a lattice based attack on this problem was proposed by Ernst, Jochemsz, May and de Weger. In this paper, we pr...
متن کامل